AN EXTENSION OF THE CONDORCET CRITERION AND KEMENY ORDERS by

نویسنده

  • Michel Truchon
چکیده

The usual Condorcet Criterion says that if an alternative is ranked ahead of all other alternatives by an absolute majority of voters, it should be declared the winner. The following partial extension of this criterion to other ranks is proposed: If an alternative is consistently ranked ahead of another alternative by an absolute majority of voters, it should be ahead in the final ranking. The term "consistently" refers to the absence of cycles in the majority relation involving these two alternatives. If there are cycles, this criterion gives partial orders that can be completed with the Kemeny rule. An algorithm to construct Kemeny orders is presented. It is based on a result saying that a complete Kemeny order over all alternatives can be obtained by splicing together Kemeny orders on the subsets of an admissible partition of the alternatives underlying the Extended Condorcet Criterion.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hyper-stable social welfare functions

We introduce a new consistency condition for neutral social welfare functions, called hyperstability. A social welfare function α selects a complete weak order from a profile PN of linear orders over any finite set of alternatives, given N individuals. Each linear order P in PN generates a linear order over orders of alternatives,called hyper-preference, by means of a preference extension. Henc...

متن کامل

Supervised Kemeny Rank Aggregation for Influence Prediction in Networks

Identifying influential individuals in a network is commonly addressed through various socio-metrics like PageRank, Hub and Authority scores [1], etc. These metrics are primarily based on the actor's location in the network [2] and often captures only a subset of the critical factors that are usually at play while predicting influence in networks like, relationship of the network (type of edge)...

متن کامل

Multi-texturing approach for paint appearance simulation on virtual vehicles

This paper proposes a new approach for paint appearance simulation. Coatings color and appearance change significantly according to lighting and observation conditions. The aim of this study is to propose both real time and accurate solutions for painted surface simulation. To solve real time constraints, we have chosen to simulate the paint appearance thanks to textures. Each texture represent...

متن کامل

Some Limit Properties of the Harmonic Mean of Transition Probabilities for Markov Chains in Markovian Environments Indexed by Cayley’s Trees

A tree T is a graph which is connected and doesn’t contain any circuits. Given any two vertices α ̸ = β ∈ T, let αβ be the unique path connecting α and β. Define the graph distance d(α, β) to be the number of edges contained in the path αβ. Let T be an infinite tree with root 0.The set of all vertices with distance n from the root is called the nth generation of T, which is denoted by L n . We d...

متن کامل

Rank Aggregation: Together We're Strong

We consider the problem of finding a ranking of a set of elements that is “closest to” a given set of input rankings of the elements; more precisely, we want to find a permutation that minimizes the Kendall-tau distance to the input rankings, where the Kendall-tau distance is defined as the sum over all input rankings of the number of pairs of elements that are in a different order in the input...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998